Asymptotics in bond percolation on expanders

نویسندگان

  • Michael Krivelevich
  • Eyal Lubetzky
  • Benny Sudakov
چکیده

We consider supercritical bond percolation on a family of high-girth d-regular expanders. Alon, Benjamini and Stacey (2004) established that its critical probability for the appearance of a linearsized (“giant”) component is pc = 1/(d − 1). Our main result recovers the sharp asymptotics of the size and degree distribution of the vertices in the giant at any p > pc, as well as that of its 2-core. It was further shown in [1] that the second largest component, at any 0 < p < 1, has size at most n for some ω < 1. We show that, unlike the situation in the classical Erdős–Rényi random graph, the second largest component in bond percolation on a regular expander, even with an arbitrarily large girth, can have size n ′ for ω′ arbitrarily close to 1. Moreover, as a by-product of that construction, we answer negatively a question of Benjamini (2013) on the relation between the diameter of a component in percolation on expanders and the existence of a giant component. Finally, we establish other typical features of the giant component, e.g., the existence of a linear path.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Brownian Bridge Asymptotics in the Subcritical Phase of Bernoulli Bond Percolation Model

For a given point ~a in Zd, we prove that a cluster in the d-dimensional subcritical Bernoulli bond percolation model conditioned on connecting points (0, ..., 0) and n~a if scaled by 1 n‖~a‖ along ~a and by 1 √ n in the orthogonal directions converges asymptotically to Time × (d− 1)-dimensional Brownian bridge. 1

متن کامل

Brownian Bridge Asymptotics for the Subcritical Bernoulli Bond Percolation

For the d-dimensional model of a subcritical bond percolation (p < pc) and a point ~a in Zd, we prove that a cluster conditioned on connecting points (0, ..., 0) and n~a if scaled by 1 n‖~a‖ along ~a and by 1 √ n in the orthogonal direction converges asymptotically to Time × (d− 1)-dimensional Brownian Bridge.

متن کامل

Asymptotics in High Dimensions for Percolation

We prove that the critical probability for bond or site percolation on Z is asymptotically equal to 1/(2d) as d → ∞. If the probability of a bond (respectively site) to be occupied is γ/(2d) with γ > 1, then for the bond model the percolation probability converges as d → ∞ to the strictly positive solution y(γ) of the equation y = 1− exp(−γy). In the site model the percolation probability is as...

متن کامل

Equality of Lifshitz and Van Hove Exponents on Amenable Cayley Graphs

We study the low energy asymptotics of periodic and random Laplace operators on Cayley graphs of amenable, finitely generated groups. For the periodic operator the asymptotics is characterised by the van Hove exponent or zeroth Novikov-Shubin invariant. The random model we consider is given in terms of an adjacency Laplacian on site or edge percolation subgraphs of the Cayley graph. The asympto...

متن کامل

Percolation on finite graphs and isoperimetric inequalities

Consider a uniform expanders family Gn with a uniform bound on the degrees. It is shown that for any p and c > 0, a random subgraph of Gn obtained by retaining each edge, randomly and independently, with probability p, will have at most one cluster of size at least c|Gn|, with probability going to one, uniformly in p and the size of the expander. The method from Ajtai, Komlós and Szemerédi [1] ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018